minimax principle

minimax principle
zasada minimaks
zasada minimalizacji maksymalnego ryzyka

English-Polish dictionary for engineers. 2013.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • minimax principle — minimakso principas statusas T sritis fizika atitikmenys: angl. minimax principle vok. Mini Max Prinzip, n; Minimaxprinzip, n; Minimum Maximum Prinzip, n rus. принцип минимакса, m pranc. principe de minimax, m …   Fizikos terminų žodynas

  • minimax principle — noun : a principle of choice for a decision problem: one should choose the action which minimizes the loss that can be suffered even under the worst circumstances …   Useful english dictionary

  • Courant minimax principle — In mathematics, the Courant minimax principle gives the eigenvalues of a real symmetric matrix. It is named after Richard Courant. Introduction The Courant minimax principle gives a condition for finding the eigenvalues for a real symmetric… …   Wikipedia

  • Minimax — This article is about the decision theory concept. For other uses, see Minimax (disambiguation). Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a… …   Wikipedia

  • minimax theorem — noun : a theorem in the theory of games: the lowest maximum expected loss equals the highest minimum expected gain * * * minimax theorem, a principle in the theory of games which states that in an optimal strategy one player plays so as to… …   Useful english dictionary

  • principe de minimax — minimakso principas statusas T sritis fizika atitikmenys: angl. minimax principle vok. Mini Max Prinzip, n; Minimaxprinzip, n; Minimum Maximum Prinzip, n rus. принцип минимакса, m pranc. principe de minimax, m …   Fizikos terminų žodynas

  • Théorème du minimax — de von Neumann John von Neumann …   Wikipédia en Français

  • Théorème du minimax de von Neumann — John von Neumann Vers où faut il …   Wikipédia en Français

  • Yao's principle — Yaos principle states that the expected cost of any randomized algorithm for solving a given problem, on the worst case input for that algorithm, can be no better than the expected cost, for a worst case random probability distribution on the… …   Wikipedia

  • Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… …   Wikipedia

  • Brute-force search — In computer science, brute force search or exhaustive search, also known as generate and test, is a trivial but very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”